Mumford-Shah Model for One-to-One Edge Matching

نویسندگان

  • Jingfeng Han
  • Benjamin Berkels
  • Marc Droske
  • Joachim Hornegger
  • Martin Rumpf
  • Carlo Schaller
  • Jasmin Scorzin
  • Horst Urbach
چکیده

This paper presents a new algorithm based on the Mumford-Shah model for simultaneously detecting the edge features of two images and jointly estimating a consistent set of transformations to match them. Compared to the current asymmetric methods in the literature, this fully symmetric method allows one to determine one-to-one correspondences between the edge features of two images. The entire variational model is realized in a multiscale framework of the finite element approximation. The optimization process is guided by an estimation minimization-type algorithm and an adaptive generalized gradient flow to guarantee a fast and smooth relaxation. The algorithm is tested on T1 and T2 magnetic resonance image data to study the parameter setting. We also present promising results of four applications of the proposed algorithm: interobject monomodal registration, retinal image registration, matching digital photographs of neurosurgery with its volume data, and motion estimation for frame interpolation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An upper bound for the regularity of powers of edge ideals

‎A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$‎, ‎denoted by match$(G)$‎. ‎In this paper‎, ‎we provide a generalization of this result for powers of edge ideals‎. ‎More precisely‎, ‎we show that for every graph $G$ and every $sgeq 1$‎, ‎$${rm reg}( R‎/ ‎I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...

متن کامل

Robust Edge Detection Using Mumford-Shah Model and Binary Level Set Method

A new approximation of the Mumford-Shah model is proposed for edge detection, which could handle open-ended curves and closed curves as well. The essential idea is to treat the curves by narrow regions, and use a sharp interface technique to solve the approximate Mumford-Shah model. A fast algorithm based on the augmented Lagrangian method is developed. Numerical results show that the proposed ...

متن کامل

Segmentation and Dimension Reduction in Hyperspectral Imaging

Edge detection is one of the most important problems in image processing. The applications range from segmentation of the boundaries of an object to inpainting of an occluded region. This project considers edge detection mainly in the context of classifying materials using hyperspectral data [3]. Informally, an edge is a curve in the domain of an image in which pixel intensities on one side dif...

متن کامل

Mumford-Shah Regularizer with Spatial Coherence

As recently discussed by Bar, Kiryati, and Sochen in [3], the Ambrosio-Tortorelli approximation of the Mumford-Shah functional defines an extended line process regularization where the regularizer has an additional constraint introduced by the term ρ|∇v|. This term mildly forces some spatial organization by demanding that the edges are smooth. However, it does not force spatial coherence such a...

متن کامل

Bounding cochordal cover number of graphs via vertex stretching

It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society

دوره 16 11  شماره 

صفحات  -

تاریخ انتشار 2007